|
|
Diffusion Evolutionary Algorithm
Mészáros, István ; Pospíchal, Petr (referee) ; Jaroš, Jiří (advisor)
There are new trends in artificial intelligence nowadays. Methods known as evolutionary algorithms are one of them. These algorithms allow us to design and optimize systems using computers. One of the variants of evolutionary algorithms is the diffusion evolutionary algorithm. This type of algorithms is able to run in parallel, and besides that it brings many positive features. The question is under what conditions the diffusion variant of evolutionary algorithms can effectively be used. Is it possible to use for planning systems and for problem optimization? Why are they more favorable than other types of evolutionary algorithms? This work tries to answer these questions and explain the behavior of these algorithms.
|
|
|
Automated Test Documentation Generator for BeakerLib Tests
Kulda, Jiří ; Smrčka, Aleš (referee) ; Vojnar, Tomáš (advisor)
The aim of this work in cooperation with Red Hat Czech company is to design, implement and verify documentation generator for test written using BeakerLib library, which effectively creates documentation from BeakerLib tests without any documentation markup. In the first step generator parses data from every BeakerLib command in the test. Subsequently data are transformed as a natural language information. At the end generator transforms this information into documentation template. In this case an argparse method was used to find possible data from BeakerLib commands. In contrast to existing documentation generators this generator brings a new way of documentary creation from tests without any documentation markup. Thanks to this point of view we can generate documentation, which is created on base of automated understanding of test source code. Through documentation generator development time the generator was tested on three BeakerLib tests. In the end the documentation generator was tested on ten BeakerLib tests which were randomly selected.
|
|
|
Genetic Algorithms
Miček, David ; Pohl, Jan (referee) ; Honzík, Petr (advisor)
This thesis presents description of Genetic algorithm. The description begins with theory of complexity and following basic theory of genetic algorithm. Next part explains the principle of all three tasks – travelling salesman problem, knapsack problem and evolution of algorithm for five-in-a-row. The main focus was on developing the algorithm for five-in-a-row. The results were tested with other similar algorithms from internet. In case of travelling salesman problem and knapsack problem, the results were compared with gradient optimization methods.
|
|
| |
|
|
The knapsack and its applications
Linkeová, Romana ; Příhoda, Pavel (advisor) ; Žemlička, Jan (referee)
Title: The knapsack and its applications Author: Romana Linkeová Department: Department of Algebra Supervisor: doc. Mgr. Pavel Příhoda, Ph.D., Department of Algebra Abstract: This thesis is focused on various aspects of cryptosystems based on NP (non-deterministic polynomial) complete knapsack problem. From the theory of complexity point of view, the less known parts of the proof of knapsack problem NP completeness are shown in detail. From the cryptographical point of view, a demonstration of breaking of the Merkle-Hellman cryptosystem (the basic de- sign of knapsack-type cryptosystems) is provided, showing that poor parameters choice can lead to easy obtaining of the whole private key. Another contribution of this thesis consists in a presented proposal of a new cryptosystem concept based on the matrix 0-1 knapsack problem. This concept was developed in order to prevent known attacks, however, in the thesis we provide a proof analogous to J. C. Lagarias and A. M. Odlyzko, 1985, which shows that an attack based on the LLL algorithm will be successful on the majority of the matrix 0-1 kna- psack problem cryptosystems. Finally, a list of modern cryptosystems based on the knapsack problem is provided and a cryptanalysis thereof is given. Keywords: knapsack problem, NP complete problems, LLL algorithm 1
|
|
|
Variants of knapsack cryptosystems
Kučerová, Michaela ; Příhoda, Pavel (advisor) ; Žemlička, Jan (referee)
The topic of this thesis is a cryptosystem, precisely a public key encryption scheme, that is based on the knapsack problem. At first we formulate terms like \mathcal{NP} -complete problem, one-way function, hard-core predicate, public key encryption scheme and semantic security which we connect in this thesis. After that we present the knapsack problem. Then we prove that the knapsack problem with appropriate parameters has a property that leads to semantic security of the encryption scheme which we present afterwards. This public key encryption scheme is based on the scheme proposed by Vadim Lyubashevsky, Adriana Palacio and Gil Segev. Powered by TCPDF (www.tcpdf.org)
|
|
| |
|
|
Diffusion Evolutionary Algorithm
Mészáros, István ; Pospíchal, Petr (referee) ; Jaroš, Jiří (advisor)
There are new trends in artificial intelligence nowadays. Methods known as evolutionary algorithms are one of them. These algorithms allow us to design and optimize systems using computers. One of the variants of evolutionary algorithms is the diffusion evolutionary algorithm. This type of algorithms is able to run in parallel, and besides that it brings many positive features. The question is under what conditions the diffusion variant of evolutionary algorithms can effectively be used. Is it possible to use for planning systems and for problem optimization? Why are they more favorable than other types of evolutionary algorithms? This work tries to answer these questions and explain the behavior of these algorithms.
|
|
|
Automated Test Documentation Generator for BeakerLib Tests
Kulda, Jiří ; Smrčka, Aleš (referee) ; Vojnar, Tomáš (advisor)
The aim of this work in cooperation with Red Hat Czech company is to design, implement and verify documentation generator for test written using BeakerLib library, which effectively creates documentation from BeakerLib tests without any documentation markup. In the first step generator parses data from every BeakerLib command in the test. Subsequently data are transformed as a natural language information. At the end generator transforms this information into documentation template. In this case an argparse method was used to find possible data from BeakerLib commands. In contrast to existing documentation generators this generator brings a new way of documentary creation from tests without any documentation markup. Thanks to this point of view we can generate documentation, which is created on base of automated understanding of test source code. Through documentation generator development time the generator was tested on three BeakerLib tests. In the end the documentation generator was tested on ten BeakerLib tests which were randomly selected.
|
|
|
Genetic Algorithms
Miček, David ; Pohl, Jan (referee) ; Honzík, Petr (advisor)
This thesis presents description of Genetic algorithm. The description begins with theory of complexity and following basic theory of genetic algorithm. Next part explains the principle of all three tasks – travelling salesman problem, knapsack problem and evolution of algorithm for five-in-a-row. The main focus was on developing the algorithm for five-in-a-row. The results were tested with other similar algorithms from internet. In case of travelling salesman problem and knapsack problem, the results were compared with gradient optimization methods.
|
guest ::
